On-line Learning and the Metrical Task System Problem
ثبت نشده
چکیده
منابع مشابه
On - line Learning and the Metrical Task
The problem of combining expert advice, studied extensively in the Computational Learning Theory literature, and the Metrical Task System (MTS) problem, studied extensively in the area of On-line Algorithms, contain a number of interesting similarities. In this paper we explore the relationship between these problems and show how algorithms designed for each can be used to achieve good bounds a...
متن کاملThe influence of lookahead in competitive on-line algorithms
In the competitive analysis of on-line problems, an on-line algorithm is presented with a sequence of requests to be served. The on-line algorithm must satisfy each request without the knowledge of any future requests. We consider the question of lookahead in on-line problems: What improvement can be achieved in terms of competitiveness, if the on-line algorithm sees not only the present reques...
متن کاملOn Multi-threaded Metrical Task Systems
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general models of on-line computation, such as Metrical Task Systems. However, there exist on-line problems in which the requests are organized in more than one independent thread. In this more general framework, at every moment ...
متن کاملOn - line Choice of On - line
Let fA1; A2; : : : ; Amg be a set of on-line algorithms for a problem P with input set I. We assume that P can be represented as a metrical task system. Each Ai has a competitive ratio ai with respect to the optimum oo-line algorithm, but only for a subset of the possible inputs such that the union of these subsets covers I. Given this setup, we construct a generic deterministic on-line algorit...
متن کاملChapter 1 On - line Choice of On - line
Let fA1; A2; : : : ; Amg be a set of on-line algorithms for a problem P with input set I. We assume that P can be represented as a metrical task system. Each Ai has a competitive ratio ai with respect to the optimum oo-line algorithm, but only for a subset of the possible inputs such that the union of these subsets covers I. Given this setup, we construct a generic deterministic on-line algorit...
متن کامل